Tableaux for Non-normal Public Announcement Logic
نویسندگان
چکیده
منابع مشابه
Tableaux for Public Announcement Logic
Public announcement logic extends multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. In this article we propose a labelled tableau calculus for this logic, and show that it decides satisfiability of formulas in deterministic polynomial space. Since this problem is known to be PSPACE-complete, it follows that...
متن کاملA Tableau Method for Public Announcement Logics
Public announcement logic is an extension of multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. We propose a labelled tableau-calculus for this logic. We also present an extension of the calculus for a logic of arbitrary announcements.
متن کاملKE Tableaux for Public Announcement Logic
Public announcement logic (PAL) is a simple dynamic epistemic logic extending reasoning about knowledge of agents with a modal operator for simultaneous and transparent knowledge updates. This logic is no more expressive than epistemic logic (EL) without updates, but exhibits compact representation of a number of complex epistemic situations. A labeled tableau proof system to reason with these ...
متن کاملDepartment of Computer Science , University of Otago
Public announcement logic is an extension of multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. We propose an extension of public announcement logic with a dynamic modal operator that expresses what is true after arbitrary announcements. Intuitively, [!]φ expresses that φ is true after an arbitrary announcem...
متن کاملBilattice Public Announcement Logic
Building on recent work on bilattice modal logic and extensions of public announcement logic to a non-classical setting, we introduce a dynamic epistemic logic having the logic of modal bilattices as propositional support. Bilattice logic is both inconsistency-tolerant and paracomplete, thus suited for applications in contexts with multiple sources of information, where one may have to deal wit...
متن کامل